A Neural Comprehensive Ranker (NCR) for Open-Domain Question Answering
نویسندگان
چکیده
This paper proposes a novel neural machine reading model for open-domain question answering at scale. Existing machine comprehension models typically assume that a short piece of relevant text containing answers is already identified and given to the models, from which the models are designed to extract answers. This assumption, however, is not realistic for building a large-scale open-domain question answering system which requires both deep text understanding and identifying relevant text from corpus simultaneously. In this paper, we introduce Neural Comprehensive Ranker (NCR) that integrates both passage ranking and answer extraction in one single framework. A Q&A system based on this framework allows users to issue an open-domain question without needing to provide a piece of text that must contain the answer. Experiments show that the unified NCR is able to outperform the states-of-the-art in both retrieval of relevant text and answer extraction.
منابع مشابه
R$^3$: Reinforced Reader-Ranker for Open-Domain Question Answering
In recent years researchers have achieved considerable success applying neural network methods to question answering (QA). These approaches have achieved state of the art results in simplified closed-domain settings such as the SQuAD (Rajpurkar et al. 2016) dataset, which provides a preselected passage, from which the answer to a given question may be extracted. More recently, researchers have ...
متن کاملR: Reinforced Ranker-Reader for Open-Domain Question Answering
In recent years researchers have achieved considerable success applying neural network methods to question answering (QA). These approaches have achieved state of the art results in simplified closed-domain settings such as the SQuAD (Rajpurkar et al. 2016) dataset, which provides a preselected passage, from which the answer to a given question may be extracted. More recently, researchers have ...
متن کاملInvestigating Embedded Question Reuse in Question Answering
The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...
متن کاملAdvances in Open Domain Question Answering, edited by Tomek Strzalkowski and Sanda Harabagiu
This edited volume provides an excellent, comprehensive introduction to recent research on open-domain question answering, meaning that the question-answering systems are not used merely in specific, narrow domains, but rather in domains such as news or the Internet. Most of the chapters describe systems that have been developed for the Advanced Question Answering for Intelligence, or AQUAINT, ...
متن کاملSemantic Parsing for Single-Relation Question Answering
We develop a semantic parsing framework based on semantic similarity for open domain question answering (QA). We focus on single-relation questions and decompose each question into an entity mention and a relation pattern. Using convolutional neural network models, we measure the similarity of entity mentions with entities in the knowledge base (KB) and the similarity of relation patterns and r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1709.10204 شماره
صفحات -
تاریخ انتشار 2017